chromatic number
英 [krəˈmætɪk ˈnʌmbə(r)]
美 [krəˈmætɪk ˈnʌmbər]
网络 色数; 着色数; 点色数; 染色数; 全色数
双语例句
- The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。 - The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。 - In this paper the entire chromatic number of maximal outer planar graph G with △( G)
本文给出了△（G）＜6的极大外平面图的边面金色数，其中△（G）表示G的最大度。 - A note of the adjacent vertex-distinguishing total chromatic number of k-cube graph;
k-方体图邻点可区别全色数（英文） - In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。 - The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。 - In this paper, we give a tree with more simple structure whose relaxed game chromatic number is equal to the maximum of the game chromatic number of forests.
给出了放松对策色数能够达到树族放松对策色数最大值且结构非常简单的树。 - In this paper, we give the formulas to compute the Fractional chromatic number of some particular graphs.
本文研究了一些特殊图形的分数色数，给出了计算这些图形分数色数的公式，并且对公式进行了证明。 - In this paper, we obtain the game chromatic number and relaxed game chromatic number of wheel and fan.
讨论了图的二人对策着色和放松对策着色，给出了轮图与扇图的对策色数与放松对策色数。 - The minimum number of colors required for an adjacent vertex-distinguishing total coloring of a simple graph G is called the adjacent vertex-distinguishing total chromatic number, denoted by xat ( G).
若一个正常全染色其相邻顶点的色集不同时，就称之为邻点可区别全染色，邻点可区别全染色所用颜色的最小数称为邻点可区别全色数。 - On the star total chromatic number of Mycielski's graphs of complete graphs and complete-partite graphs
完全图和完全多部图的Mycielski图的星全染色 - The upper bound of conditional chromatic number of graphs and the graphs satisfying this bound are obtained.
得到了图的条件色数的上界和达到上界的图类。 - In this paper, we obtain a quality of caterpillars and an explicit formula for the equitable chromatic number of caterpillars.
可得到毛虫树的一个性质和计算毛虫树的均匀色数的一个精确计算公式。 - Adjacent vertex-distinguish incidence chromatic number of crown graph
皇冠图G（n，m）的邻点可区别关联色数 - The bounded chromatic number is the smallest number of colors such that G admits a k-bounded coloring.
图G的k有界染色数χk（G）是指对图G进行k有界染色所用的最少颜色数。 - Circular Chromatic Number and Circular Imperfect Graphs
圆色数和圆不完美图 - This paper introduce the edge game chromatic, and then determines the property of the edge game chromatic number.
本文介绍了边对策着色，讨论了图G的边对策着色的性质。 - This paper shows that the path chromatic number of any P_4-free 2-connected planar graph is 2.
本文证明了P4-free2-连通平面图的路色数为2。 - In this paper, the total equitable coloring of planar graphs is defined, some conjecture on equitable coloring proposed, and some results about equitable chromatic number of some special graphs have been achieved.
定义了平面图的均匀全染色，提出了关于均匀全色数的若干猜想，并得到了若干特殊图的均匀全色数。 - This paper deals with path chromatic number of graphs.
本文研究图的路色数。 - A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number.
一个图当它的圆色数和分色数相等称之为starextremal。 - In this paper, we determine the vertex chromatic number of Halin graphs, and then give a linear time algorithm for colouring of Halin graphs.
本文解决了Halin图的点色数问题，并给出了一个可在线性时间内对Halin图进行点着色的算法。 - The edge chromatic number and equitable total chromatic number of join graph of star and complete bipartite graph is obtained in this paper.
本文得到了m+1阶星和完全等二部图联图的边色数和均匀全色数。 - The minimum number required for an adjacent-strong edge coloring of G is called the adjacent strong edge chromatic number.
对一个图G进行邻强边染色所需要的最少的颜色数称为是G的邻强边色数。 - Chromatic number and fractional chromatic number are two important parameters of a graph.
分式色数和点色数是图的两个重要参数。 - The adjacent strong edge chromatic number of several class of complete 4-partite graphs are obtained.
得到了几类完全4-部图的邻强边色数。 - By labeling the vertexes of a graph with color, this paper gives the chromatic number ⅱ of corona graphs of some graphs and the coloring strategy ⅱ.
利用顶点标号方法，给出了一些图的冠图的对策色数和色对策。 - The incidence chromatic number of 3-regular Halin graphs is determined by studying its structural property.
通过研究3-正则Halin图的结构性质，确定了3-正则Halin图的关联色数。 - With this characterization, the bandwidth, topological bandwidth and the path chromatic number for unit interval graphs are determined.
并由该刻划确定出单位区间图的带宽、拓扑带宽和路色数。 - One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.
其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。